Atomic-scale simulations for lithium dendrite growth driven by strain gradient

Dendrite formation is a major obstacle, e.g., capacity loss and short circuit, to the next-generation high-energy-density lithium (Li)-metal batteries. The development of successful Li dendrite mitigation strategies is impeded by an insufficient understanding in Li dendrite growth mechanisms. The Li-plating-induced internal stress in Li-metal and its effects on dendrite growth have been widely studied, but the underlying microcosmic mechanism is elusive. In the present study, the role of the plating-induced stress in dendrite formation is analyzed through first-principles calculations and ab initio molecular dynamic (AIMD) simulations. It is shown that the deposited Li forms a stable atomic nanofilm structure on the copper (Cu) substrate, and the adsorption energy of Li atoms increases from the Li-Cu interface to the deposited Li surface, leading to more aggregated Li atoms at the interface. Compared with the pristine Li-metal, the deposited Li in the early stage becomes compacted and suffers the in-plane compressive stress. Interestingly, there is a giant strain gradient distribution from the Li-Cu interface to the deposited Li surface, making the deposited atoms adjacent to the Cu surface tend to press upwards with perturbation and causing the dendrite growth. This provides an insight into the atomicscale origin of Li dendrite growth, and may be useful for suppressing the Li dendrite in Li-metal-based rechargeable batteries.     

用标准件对梯度磁场定标

就标准厚度卡片在霍尔传感器的定标方面的应用作了有益的探讨。在纵向测量微小长度时,霍尔片处于磁场边缘位置,其对磁场的梯度更大,即灵敏度更高,且靠中心位置的线性更好。     

三维位势问题的梯度边界积分方程的新解法

三维位势问题的边界元分析中,关于坐标变量的边界位势梯度的计算是一个困难的问题. 已有一些方法着手解决这个问题,然而,这些方法需要复杂的理论推导和大量的数值计算. 本文提出求解一般边界位势梯度边界积分方程的辅助边值问题法. 该方法构造了与原边界值问题具有相同解域的辅助边值问题,该辅助边值问题具有已知解,因此通过求解此辅助边值问题,可获得梯度边界积分方程对应的系统矩阵,然后将此系统矩阵应用于求解原边值问题,求解过程非常简单,只需求解一个线性系统即可获得原边值问题的解. 值得注意的是,在求解原边值问题时,不再需要重新计算系统矩阵,因此辅助边值问题法的效率并不很差. 辅助边值问题法避免了强奇异积分的计算,具有数学理论简单、程序设计容易、计算精度高等优点,为坐标变量梯度边界积分方程的求解提供了一个新的途径. 3个标准的数值算例验证了方法的有效性.      

Skyrmion transport driven by pure voltage generated strain gradient

The magnetic skyrmion transport driven by pure voltage-induced strain gradient is proposed and studied via micromagnetic simulation. Through combining the skyrmion with multiferroic heterojunction, a voltage-induced uniaxial strain gradient is adjusted to move skyrmions. In the system, a pair of short-circuited trapezoidal top electrodes can generate the symmetric strain. Due to the symmetry of strain, the magnetic skyrmion can be driven with a linear motion in the middle of the nanostrip without deviation. We calculate the strain distribution generated by the trapezoidal top electrodes pair, and further investigate the influence of the strain intensity as well as the strain gradient on the skyrmion velocity. Our findings provide a stable and low-energy regulation method for skyrmion transport.     

一阶最优性条件研究

本对由Botsko的关于多变量函数取极值的一阶导数检验条件定理^[1]进行了分析研究，给出了更实用而简捷的差别条件。最后，举出若干例子予以说明。     

Numerical solutions of the shallow water equations with discontinuous bed topography

A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with z_b^‐ for the left and z_b⁺ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Stochastic techniques for global optimization: A survey of recent advances

In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.